A combinatorial auction‐based approach for the ridesharing in a student transportation system

Here, a mixed-integer linear programming model is developed to represent transportation system of students traveling from/to university campus. The concept ridesharing used and the mechanism combinatorial auctions incorporated within routing-based model. mathematical based on vehicle routing problem along with appropriate constraints accommodating features that express auction clearing phase. A hybrid heuristic-based optimization framework, takes advantage meta-heuristic algorithms improve an initial solution, also solve large-sized instances problem. Three meta-heuristics, namely particle swarm optimization, dragonfly algorithm, imperialist competitive are implemented in proposed whose performances assessed compared. Moreover, two improvement heuristic procedures attempt outcomes foregoing meta-heuristics compared as well.